A Tractable Class of Disjunctive Deductive Databases
نویسندگان
چکیده
In general, computing answers to queries in disjunctive deductive databases is CoNP-complete and therefore computationally infeasible. However, there are some tractable classes of disjunctive databases. In this paper, we present polynomial time algorithms to compute answers to queries in one such tractable class of disjunctive databases where at most two atoms are allowed in any disjunction.
منابع مشابه
Partial Evidential Stable Models for Disjunctive Deductive Databases
In this paper we consider the basic semantics of stable and partial stable models for disjunctive deductive databases (with default negation), cf. [9,16]. It is well–known that there are disjunctive deductive databases where no stable or partial stable models exist, and these databases are called inconsistent w.r.t. the basic semantics. We define a consistent variant of each class of models, wh...
متن کاملDisjunctive Deductive Databases : Semantics , Updates , and Architecture ?
The basic assumption in relational and deductive databases is that there are no gaps in our knowledge. That is, the database cannot store data that contain null values or data that is indeenite. In practical situations knowledge is not precise, and there are gaps in our knowledge. These gaps may be due to null values in the data, may arise when we combine several databases that lead to inconsis...
متن کاملAggregation in Disjunctive Deductive Databases
Practical applications of deductive databases often require the use of extended features like disjunctive information, aggregation operators or default negation. But it has been unclear how one could deal with aggregation in the presense of recursion and disjunction. Usually , there is the requirement that deductive databases must be stratiied w.r.t. aggregation, i.e. a predicate q that is deen...
متن کاملDeductive Databases with Conditional Facts
Department of Computer Science The Wichita State University Wichita, Kansas 67260-0083, USA e-mail: [email protected] Abstract. We introduce the notion of conditional facts in deductive databases. The language used to express the conditions in the basic facts does not involve constructs used to describe the database and is motivated by its potential usefulness in expressing disjunctive facts and ...
متن کاملView Updates in Disjunctive Deductive Databases Based on SLD-Resolution
View update problem in deductive databases is concerned with the translation of an update of an intensional relation by modifying the underlying relations of the extensional part of the database. In the existing algorithms for view updates of a deductive database, a sound and complete proof procedure is usually employed to generate explanations for the atom to be inserted or deleted. In the cas...
متن کامل